Partitioning computations and parallel processing
نویسندگان
چکیده
منابع مشابه
Network Partitioning of Data Parallel Computations
Partitioning data parallel computations across a network of heterogeneous workstations is a dificult problem for the user: We have developed a runtime partitioning method for choosing the number and type of processors to apply to a data parallel computation, and a decomposition of the data domain in order to achieve reduced completion time. The partitioning method utilizes information about the...
متن کاملOn Partitioning Grid-Structured Parallel Computations
This paper studies a special instance of the graph partitioning problem motivated by an application in parallel processing. When a parallel computation is represented by a weighted task graph, we consider the problem of mapping each node in the graph to a processor in a linear array. We focus on a particular type of computation, a grid structured computation (GSC), where the task graph is a gri...
متن کاملGraph Partitioning Algorithms for Distributing Workloads of Parallel Computations
This paper surveys graph partitioning algorithms used for parallel computing, with an emphasis on the problem of distributing workloads for parallel computations. Geometric, structural, and refinementbased algorithms are described and contrasted. In addition, multilevel partitioning techniques and issues related to parallel partitioning are addressed. All algorithms are evaluated qualitatively ...
متن کاملAn Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
Efficient use of a distributed memory parallel computer requires that the computational load be balanced across processors in a way that minimizes interprocessor communication. A new domain mapping algorithm is presented that extends recent work in which ideas from spectral graph theory have been applied to this problem. The generalization of spectral graph bisection involves a novel use of mul...
متن کاملA framework for partitioning parallel computations in heterogeneous environments
In this paper we present a framework for partitioning data parallel computations across a heterogeneous metasystem at runtime. The framework is guided by program and resource information which are made available to the system. Three difficult problems are handled by the framework: processor selection, task placement, and heterogeneous data domain decomposition. Solving each of these problems co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sadhana
سال: 1986
ISSN: 0256-2499,0973-7677
DOI: 10.1007/bf02747522